On the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method. Ill
نویسنده
چکیده
The discrepancy of a sequence of pseudo-random numbers generated by the linear congruential method, both homogeneous and inhomogeneous, is estimated for parts of the period that are somewhat larger than the square root of the modulus. The analogous problem for an arbitrary linear congruential generator modulo a prime is also considered, the result being particularly interesting for maximal period sequences. It is shown that the discrepancy estimates in this paper are best possible apart from logarithmic factors.
منابع مشابه
On the Distribution of Pseudo -Random Numbers Generated by the Linear Congruential Method. II
The discrepancy of a sequence of pseudo-random numbers generated by the linear congruential method is estimated for parts of the period which are somewhat larger than the square root of the modulus. Applications to numerical integration are mentioned.
متن کاملThe Period of Pseudo-Random Numbers Generated by Lehmer's Congruential Method
It is well known that a sequence of randon numbers may be generated by Lehmer's congruential method. This method was originally executed in the formula; x n+1=23xn (mod 108+1). The period of this sequence eomes up to 5, 882, 352 which seems to be sufficient for almost all of our applications. The purpose of this paper is to provide an elementary method to account such a period of pseudo-random ...
متن کاملOn the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method
The discrepancy of sequences of pseudo-random numbers generated by the linear congruential method is estimated, thereby improving a result of Jagerman. Applications to numerical integration are mentioned. Let m be a modulus with primitive root X, and let y0 be an integer in the least residue system modulo m with g.c.d.(y0, m) = 1. We generate a sequence y0, yu of integers in the least residue s...
متن کاملUsing Linear Congruential Generators for Cryptographic Purposes
We try to provide an alternative attitude toward the use of a Linear Congruential Generator (LCG here after) in generating pseudo-random numbers for some cryptographic purpose. In particular, we choose email encryption as our cryptographic application. Our encryption will be considered secure if the attacker cannot infer the pseudo-random numbers without knowing the parameters of the LCG. We im...
متن کامل"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case
The DSS signature algorithm requires the signer to generate a new random number with every signature. We show that if random numbers for DSS are generated using a linear congruential pseudorandom number generator (LCG) then the secret key can be quickly recovered after seeing a few signatures. This illustrates the high vulnerability of the DSS to weaknesses in the underlying random number gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010